Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
261	LNAIStrongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures Add to Reading List Source URL: folk.uib.no Language: English - Date: 2006-10-10 15:15:42 Model theory Interpretation Substitution Compactness theorem Linear temporal logic Differential forms on a Riemann surface
262	On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2011-07-18 11:44:43 Combinatorial optimization Graph theory NP-complete problems Network theory Edsger W. Dijkstra Steiner tree problem Simplex Matching Bipartite graph Graph Shortest path problem A* search algorithm
263	December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:09:13 Graph theory Mathematics Computational complexity theory Network theory Spanning tree NP-complete problems Edsger W. Dijkstra Shortest path problem Longest path problem Minimum spanning tree Reverse-delete algorithm
264	First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b Add to Reading List Source URL: www.preining.info Language: English - Date: 2014-04-03 01:14:57 Logic Mathematical logic Abstraction Model theory Non-classical logic Logic in computer science Predicate logic First-order logic Boolean satisfiability problem Gdel numbering Many-valued logic Kripke semantics
265	Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2015-12-18 15:57:04 Graph theory Bipartite graph Parity Graph Ear decomposition Matching NP-complete problems Graph coloring Line graph
266	Five $1,000 Problems - John H. Conway! ! ! ! Add to Reading List Source URL: cheswick.com Language: English - Date: 2014-10-13 09:47:48 Graph theory Graph Thrackle Path NP-complete problems Hamiltonian path Skew-symmetric graph
267	R Foundations and Trends in Theoretical Computer Science Vol. 9, No–210 c 2014 S. Sachdeva and N. K. Vishnoi Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-04-08 16:25:54 Mathematics Algebra Mathematical analysis Matrix theory NP-complete problems Numerical analysis Polynomial Approximation theory Pi Chebyshev polynomials Eigenvalues and eigenvectors Matrix
268	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
269	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
270	REMARKS ON MOTIVIC HOMOTOPY THEORY OVER ALGEBRAICALLY CLOSED FIELDS PO HU, IGOR KRIZ AND KYLE ORMSBY Abstract. We discuss certain calculations in the 2-complete motivic stable homotopy category over an algebraically clos Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2010-10-12 22:16:22 Homotopy theory Motivic cohomology Spectrum Cohomology Homotopy groups of spheres Homotopy Adams spectral sequence Stable homotopy theory CW complex EilenbergMacLane space Motive Norm residue isomorphism theorem

UPDATE